link-disjoint paths 链路分离路径
edge-disjoint paths problem 边不相交路径问题
node-disjoint paths 节点不相交路径
line-disjoint paths 线不相交道路
edge-disjoint paths 边不交道路
disjoint paths pair 分离路径
vertex-disjoint paths 点不相交的路
widest disjoint paths 最宽不相交路径
link disjoint paths pair 链路分离路径
·2,447,543篇论文数据，部分数据来源于NoteExpress
Disjoint paths weight accumulating algorithm is proved to be effective in correlation computing by analyzing the results of the experiments.
分析实验结果发现，不相交路径权值累积算法能有效计算网络成员关联度。
The problem in multipath routing is that it is much more difficult to find multiple node-disjoint paths because of the lack of an accurate network topology.
在没有精确的网络拓扑结构情况下，找出多条不相交路径是比较困难的。
The MSS problem seeks to compute a set of vertex-disjoint simple paths in an undirected bipartite graph under certain constraints.
MSS 问题的目标，是在一个二分无向图上寻找由互不相交的路径所构成的集合，并要求这个集合满足一些特定的条件。
应用推荐